public class Solution {
    public TreeNode pruneTree(TreeNode root) {
        delep(root,root.right);
        delep(root,root.left);
        return root;
    }
    public boolean delep(TreeNode parent,TreeNode child){
         if(parent.left==null && parent.right==null){
             return
         }
         delep(child,child.left);
         delep(child,child.right);

    }

    public int sumNumbers(TreeNode root) {
        if(root.left==null && root.right==null){
            return root.val;
        }

    }

    public class TreeNode {
      int val;
      TreeNode left;
      TreeNode right;
      TreeNode() {}
      TreeNode(int val) { this.val = val; }
      TreeNode(int val, TreeNode left, TreeNode right) {
          this.val = val;
          this.left = left;
          this.right = right;
      }
    }

    public boolean evaluateTree(TreeNode root) {
        if(root.left==null){
            return root.val==1;
        }

        if(root.val==2){
            boolean left=evaluateTree(root.left);
            boolean right=evaluateTree(root.right);
            return left|right;
        }else if(root.val==3){
            boolean left=evaluateTree(root.left);
            boolean right=evaluateTree(root.right);
            return left&right;
        }else{
            return root.val==1;
        }
    }

    public double myPow(double x, int n) {
        if(n<0){
            x=1/x;
            n=-n;
        }
        double ans=1;
        while(n!=0){
            if((n&1)==1){
                ans*=x;
            }
            x=x*x;
            n>>=1;
        }
        return ans;
    }
}
